Constraint Satisfaction by Survey Propagation
نویسندگان
چکیده
A. Braunstein, M. Mézard, M. Weigt, R. Zecchina International School for Advanced Studies (SISSA), via Beirut 9, 34100 Trieste, Italy Laboratoire de Physique Théorique et Modèles Statistiques, CNRS and Université Paris Sud, Bât. 100, 91405 Orsay cedex, France 3 Institute for Theoretical Physics, University of Göttingen, Tammannstr. 1, 37077 Göttingen, Germany The Abdus Salam International Centre for Theoretical Physics (ICTP), Str. Costiera 11, 34100 Trieste, Italy
منابع مشابه
Survey Propagation: Iterative Solutions to Constraint Satisfaction Problems
Iterative algorithms, such as the well known Belief Propagation algorithm, have had much success in solving problems in statistical inference and coding and information theory. Survey Propagation attempts to apply iterative message passing algorithms to solve difficult combinatorial problems, in particular constraint satisfaction problems such as k-sat and coloring problems. Intuition from stat...
متن کاملBelief propagation algorithms for constraint satisfaction problems
Belief propagation algorithms for constraint satisfaction problems by Elitza Nikolaeva Maneva Doctor of Philosophy in Computer Science and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Alistair Sinclair, Chair We consider applications of belief propagation algorithms to Boolean constraint satisfaction problems (CSPs), such as ...
متن کاملFinite Energy Survey Propagation for Constraint Satisfaction Problems
The Survey Propagation (SP) algorithm [1] has recently been shown to work well in the hard region for random K-SAT problems. SP has its origins in sophisticated arguments in statistical physics, and can be derived from an approach known as the cavity method, when applied at what is called the one-step replica symmetry breaking level. In its most general form, SP can be applied to general constr...
متن کاملPerturbed Message Passing for CSP Perturbed Message Passing for Constraint Satisfaction Problems
We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Belief Propagation, smoothly interpolates two well-known inference procedures; it s...
متن کاملPerturbed message passing for constraint satisfaction problems
We introduce an efficient message passing scheme for solving Constraint Satisfaction Problems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single satisfying assignment. Our first CSP solver, called Perturbed Belief Propagation, smoothly interpolates two well-known inference procedures; it s...
متن کاملThreshold Saturation in Spatially Coupled Constraint Satisfaction Problems
We consider chains of random constraint satisfaction models that are spatially coupled across a finite window along the chain direction. We investigate their phase diagram at zero temperature using the survey propagation formalism and the interpolation method. We prove that the SAT-UNSAT phase transition threshold of an infinite chain is identical to the one of the individual standard model, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cond-mat/0212451 شماره
صفحات -
تاریخ انتشار 2002